Dorsal Preservation: The Push Down Technique Reassessed
نویسندگان
چکیده
منابع مشابه
Subsumption{oriented Push{down Automata ?
This paper presents Subsumption{oriented Push{Down Auto-mata (SPDA), a very general stack formalism used to describe forest (\AND{ OR" tree) traversals. These automata may be used for parsing or the interpretation of logic programs. SPDA allow a Dynamic Programming execution which breaks computations into combinable, sharable and storable sub{computations. They provide computation sharing and o...
متن کاملA Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique
The task of designing parsing algorithms for tree adjoining grammars could be simplified by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent definition of this class of automata and, by removing the finite-...
متن کاملA Formal Deenition of Bottom-up Embedded Push-down Automata and Their Tabulation Technique
The task of designing parsing algorithms for tree adjoining grammars could be simpliied by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent deeni-tion of this class of automata and, by removing the nite-sta...
متن کاملPush-Down Automata with Gap-Order Constraints
We consider push-down automata with data (PDAD) that operate on variables ranging over the set of natural numbers. The conditions on variables are defined via gap-order constraint. Gap-order constraints allow to compare variables for equality, or to check that the gap between the values of two variables exceeds a given natural number. The messages inside the stack are equipped with values that ...
متن کاملA redefinition of Embedded Push-Down Automata
A new definition of Embedded Push-Down Automata is provided. We prove this new definition preserves the equivalence with tree adjoining languages and we provide a tabulation framework to execute any automaton in polynomial time with respect to the length of the input string.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Aesthetic Surgery Journal
سال: 2018
ISSN: 1090-820X,1527-330X
DOI: 10.1093/asj/sjx180